On the representation of band-limited signals using finitely many bits

In this paper, we consider the question of representing an entire function of finite order and type in terms of finitely many bits, and reconstructing the function from these. Instead of making any further assumptions about the function, we measure the error in reconstruction in a suitably weighted Lp norm. The optimal number of bits in order to obtain a given accuracy is given by the Kolmogorov entropy. We determine this entropy in the case of certain compact subsets of these weighted Lp spaces, and obtain constructive algorithms to determine the asymptotically optimal bit representation from finitely many samples of the function. Our theory includes both equidistant and non-uniform sampling. The reconstructions are polynomials, having several other optimality properties.